Stochastic time-dependent vehicle routing problem: Mathematical models and ant colony algorithm
نویسندگان
چکیده
منابع مشابه
Time Dependent Vehicle Routing Problem with an Ant Colony System
IDSIA-02-03 Abstract The Time Dependent Vehicle Routing Problem, TDVRP, consists in optimally routing a fleet of vehicles of fixed capacity when the traveling times are dependent on time, that is, the time of the day when the trip on a leg was initiated. The delivery to a customer must also satisfy the customer’s delivery time window. The optimization consists in finding the solution that minim...
متن کاملAnt Colony Algorithm for the Single Loop Routing Problem
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...
متن کاملAnt Colony Algorithm for the Single Loop Routing Problem
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...
متن کاملCompetitive Vehicle Routing Problem with Time Windows and Stochastic Demands
The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...
متن کاملMin-max Vehicle Routing Problem Based on Ant Colony Algorithm
To minimize the length of travelling distance of the longest sub-route in vehicle routing problem, the max-min ant system with parameter adaptation is adopted, which can be applied to different datasets in practice. Routes are constructed by sequential and parallel methods for the customers with clustering and random distribution respectively. Since the behavior of ant colony algorithm depends ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mechanical Engineering
سال: 2015
ISSN: 1687-8140,1687-8140
DOI: 10.1177/1687814015618631